The minimal resultant locus

Numerical Computation of Minimal Polynomial Bases: A Generalized Resultant Approach

We propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F (s): The proposed method exploits the structure of the left null space of generalized Wolovich or Sylvester resultants to compute row polynomial vectors that form a minimal polynomial basis of left kernel of the given polynomial matrix. The entire procedure can be imple...

Laughlin the Probability - Resultant

Transfinite Diameter and the Resultant

We prove a formula for the Fekete-Leja transfinite diameter of the pullback of a set E ⊂ C by a regular polynomial map F , expressing it in terms of the resultant of the leading part of F and the transfinite diameter of E. We also establish the nonarchimedean analogue of this formula. A key step in the proof is a formula for the transfinite diameter of the filled Julia set of F .

On the Height of the Sylvester Resultant

X iv :m at h/ 03 10 27 6v 2 [ m at h. N T ] 1 3 M ay 2 00 4 ON THE HEIGHT OF THE SYLVESTER RESULTANT CARLOS D’ANDREA AND KEVIN G. HARE Abstract. Let n be a positive integer. We consider the Sylvester resultant of f and g, where f is a generic polynomial of degree 2 or 3 and g is a generic polynomial of degree n. If f is a quadratic polynomial, we find the resultant’s height. If f is a cubic pol...

On the Newton Polytope of the Resultant

The study of Newton polytopes of resultants and discriminants has its orgin in the work of Gelfand, Kapranov, and Zelevinsky on generalized hypergeometric functions (see e.g., [8]). Central to this theory is the notion of the A-discriminant AA, which is the discriminant of a Laurent polynomial with specified support set A (see [6, 7]). Two main results of Gelfand, Kapranov, and Zelevinsky are c...